FIRST COME FIRST SERVE
FCFS
The First-Come, First-Served (FCFS) disk scheduling algorithm is a simple approach where disk I/O requests are serviced in the order they arrive. Requests are added to a queue and executed sequentially, without considering the position of the disk head or the proximity of requests. FCFS ensures that every request is eventually serviced, but it may not be efficient in terms of minimizing seek time or optimizing disk performance.
Characteristics of FCFS:
FCFS supports non-preemptive and preemptive CPU scheduling algorithms. Tasks are always executed on a First-come, First-serve concept. FCFS is easy to implement and use. This algorithm is not much efficient in performance, and the wait time is quite high.
